Admissible rules in the implication–negation fragment of intuitionistic logic
نویسندگان
چکیده
منابع مشابه
Admissible rules in the implication-negation fragment of intuitionistic logic
Uniform infinite bases are defined for the single-conclusion and multiple-conclusion admissible rules of the implication–negation fragments of intuitionistic logic IPC and its consistent axiomatic extensions (intermediate logics). A Kripke semantics characterization is given for the (hereditarily) structurally complete implication–negation fragments of intermediate logics, and it is shown that ...
متن کاملAdmissible and Derivable Rules in Intuitionistic Logic
A well-known problem in intuitionistic logic is the existence of valid but not derivable rules. This problem seems to be related with some constructive features of intuitionism (disjunction and existence property) but appear also in modal logics. We study here a particular case of this phenomenon, admissible rules in propositional calculus. G.E.Mints in [Mi 72] give sufficients conditions for a...
متن کاملComplexity of Admissible Rules in the Implication-Negation Fragment of Intuitionistic Logic
The goal of this paper is to study the complexity of the set of admissible rules of the implication-negation fragment of intuitionistic logic IPC. Surprisingly perhaps, although this set strictly contains the set of derivable rules (the fragment is not structurally complete), it is also PSPACE-complete. This differs from the situation in the full logic IPC where the admissible rules form a co-N...
متن کاملOn The Admissible Rules of Intuitionistic Propositional Logic
We present a basis for the admissible rules of intuitionistic proposi-tional logic. Thereby a conjecture by de Jongh and Visser is proved. We also present a proof system for the admissible rules, and give semantic criteria for admissibility.
متن کاملAdmissible Rules of Lukasiewicz Logic
We investigate admissible rules of Lukasiewicz multi-valued propositional logic. We show that admissibility of multiple-conclusion rules in Lukasiewicz logic, as well as validity of universal sentences in free MV -algebras, is decidable (in PSPACE ).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2010
ISSN: 0168-0072
DOI: 10.1016/j.apal.2010.09.001